Digital signature with message recovery and its variants based on elliptic curve discrete logarithm problem
نویسندگان
چکیده
In this article, we shall adopt the concepts of elliptic curve cryptosystems and self-certified public keys to build a novel digital signature scheme with message recovery. The public key and the identity of the user can be authenticated simultaneously in recovering the message. In addition, we shall also present three extended digital signature schemes based on the proposed scheme. The first is an authenticated encryption scheme that only allows a designated verifier to retrieve and verify the message. The second is an authenticated encryption scheme with message linkages used to deliver a large message. And the third is for message flows. The authenticated encryption scheme with message linkages for message flows allows the verifier to recover partial message blocks before obtaining the whole signature. Some possible attacks will be considered, and our security analysis will show that none of them can successfully break any of the proposed schemes. C D 2003 Published by Elsevier Science B.V.
منابع مشابه
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملA Message Recovery Signature Scheme Equivalent to DSA over Elliptic Curves
The ElGamal signature([3]) is based on the difficulty of the discrete logarithm problem(DLP). For the ElGamal signature scheme, many variants like the NIST Digital Signature Algorithm(DSA)([10]) and a new signature with a message recovery feature([12]) are proposed. The message recovery feature has the advantage of small signed message length, which is effective especially in applications like ...
متن کاملA Signature Scheme with Message Recovery as Secure as Discrete Logarithm
ably secure signature scheme with message recovery based on the elliptic-curve discrete logarithm. The proposed scheme is proven to be secure in the strongest sense (i.e., existentially unforgeable against adaptively chosen message attacks) in the random oracle model under the discrete logarithm assumption. We give a concrete analysis of the security reduction. When practical hash functions are...
متن کاملMessage Recovery Signature Scheme Using Complementary Elliptic Curves
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this concept is hard to break, therefore this criteria has given mathematicians a courage to explore this area of research. Earlier in [10], we have showed a new method for imbedding plaintexts using complementary elliptic c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Standards & Interfaces
دوره 26 شماره
صفحات -
تاریخ انتشار 2004